Credal Classification based on AODE and compression coefficients

نویسندگان

  • Giorgio Corani
  • Alessandro Antonucci
چکیده

Bayesian model averaging (BMA) is a common approach to average over alternative models; yet, it usually gets excessively concentrated around the single most probable model, therefore achieving only sub-optimal classification performance. The compression-based approach (Boullé, 2007) overcomes this problem; it averages over the different models by applying a logarithmic smoothing over the models’ posterior probabilities. This approach has shown excellent performances when applied to ensembles of naive Bayes classifiers. AODE is another ensemble of models with high performance (Webb et al., 2005): it consists of a collection of non-naive classifiers (called SPODE) whose probabilistic predictions are aggregated by simple arithmetic mean. Aggregating the SPODEs via BMA rather than by arithmetic mean deteriorates the performance; instead, we propose to aggregate the SPODEs via the compression coefficients and we show that the resulting classifier obtains a slight but consistent improvement over AODE. However, an important issue in any Bayesian ensemble of models is the arbitrariness in the choice of the prior over the models. We address this problem by adopting the paradigm of credal classification, namely by substituting the unique prior with a set of priors. Credal classifier are able to automatically recognize the prior-dependent instances, namely the instances whose most probable class varies, when different priors are considered; in these cases, credal classifiers remain reliable by returning a set of classes rather than a single class. We thus develop the credal version Corresponding author: [email protected] Preprint submitted to Elsevier March 28, 2012 of both the BMA-based and the compression-based ensemble of SPODEs, substituting the single prior over the models by a set of priors. By experiments we show that both credal classifiers provide overall higher classification reliability than their determinate counterparts. Moreover, the compression-based credal classifier compares favorably to previous credal classifiers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compression-based AODE Classifiers

We propose the COMP-AODE classifier, which adopts the compression-based approach [1] to average the posterior probabilities computed by different non-naive classifiers (SPODEs). COMP-AODE improves classification performance over the wellknown AODE [10] model. COMP-AODE assumes a uniform prior over the SPODEs; we then develop the credal classifier COMPAODE*, substituting the uniform prior by a s...

متن کامل

Application of an AODE Based Classifier to Detect DOS Attacks

Digital forensics often utilize network intrusion detection systems based on various data mining methods to detect and collect evidence on intrusion events such as Denial of Service (DOS) attacks. Findings of our experiments reveal that a classification model based on averaged one-dependence estimators (AODE) can be used for this purpose. AODE is an extension of Naïve Bayes method which relies ...

متن کامل

A procedure for solving autonomous AODEs

Consider the field of rational functions Kpxq for a field K and let d dx be the usual derivative. Then Kpxq is a differential field. We call Kpxqtyu the ring of differential polynomials. Its elements are polynomials in y and the derivatives of y, i. e. Kpxqtyu Kpxqry, y1, y2, . . .s. An algebraic ordinary differential equation (AODE) is one of the form F px, y, y1, . . . , ypnqq 0 where F P Kpx...

متن کامل

Upper entropy of credal sets. Applications to credal classification

We present an application of the measure of entropy for credal sets: as a branching criterion for constructing classification trees based on imprecise probabilities which are determined with the imprecise Dirichlet model. We also justify the use of upper entropy as a global uncertainty measure for credal sets and present a deduction of this measure. We have carried out several experiments in wh...

متن کامل

Tree-Based Credal Networks for Classification

Bayesian networks are models for uncertain reasoning which are achieving a growing importance also for the data mining task of classification. Credal networks extend Bayesian nets to sets of distributions, or credal sets. This paper extends a state-of-the-art Bayesian net for classification, called tree-augmented naive Bayes classifier, to credal sets originated from probability intervals. This...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1203.5716  شماره 

صفحات  -

تاریخ انتشار 2012